Diophantine Equations and Congruences
نویسنده
چکیده
We present conditions for quadratic Diophantine equations of the form ax2 − by2 = ±1, (where 1 < a < b are integers) for which there are no solutions (x, y), yet for which there are solutions modulo n for all n ≥ 1. This generalizes work in the literature which follow as very special cases. Mathematics Subject Classification: Primary: 11D09, 11R11, 11A55; Secondary: 11R29
منابع مشابه
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interpolants in rational and real linear arithmetic. We focus on subsets of integer linear arithmetic. Our main results are polynomial time algorithms for obtaining proofs of unsatisfiability and interpolants for conjunctions of line...
متن کاملDiophantine Equations and Congruences over Function Fields
We generalize the methods of Pierce of counting solutions to the congruence X ≡ Y b mod D [8] and the square sieve method of counting squares in the sequence f(X) + g(Y ) [7] to the function field setting.
متن کاملA Generalized Fibonacci Sequence and the Diophantine Equations $x^2pm kxy-y^2pm x=0$
In this paper some properties of a generalization of Fibonacci sequence are investigated. Then we solve the Diophantine equations $x^2pmkxy-y^2pm x=0$, where $k$ is positive integer, and describe the structure of solutions.
متن کاملDiophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملCyclic Systems of Simultaneous Congruences
for fixed nonzero integers (r, s) with r > 0 and (r, s) = 1. It shows there are finitely many solutions in positive integers qi ≥ 1, and obtains sharp bounds on the maximal size of solutions for almost all (r, s). The extremal solutions for r = s = 1 are related to Sylvester’s sequence 2, 3, 7, 43, 1807, .... If the positivity condition on the integers qi is dropped, then for r = 1 these system...
متن کامل